Treemaps for space-constrained visualization of hierarchies
نویسنده
چکیده
During 1990, in response to the common problem of a filled hard disk, I became obsessed with the idea of producing a compact visualization of directory tree structures. Since the 80 Megabyte hard disk in the HCIL was shared by 14 users it was difficult to determine how and where space was used. Finding large files that could be deleted, or even determining which users consumed the largest shares of disk space were difficult tasks.
منابع مشابه
Treemaps for space-constrained visualization of hierarchies
During 1990, in response to the common problem of a filled hard disk, I became obsessed with the idea of producing a compact visualization of directory tree structures. Since the 80 Megabyte hard disk in the HCIL was shared by 14 users it was difficult to determine how and where space was used. Finding large files that could be deleted, or even determining which users consumed the largest share...
متن کاملCascaded treemaps: examining the visibility and stability of structure in treemaps
Treemaps are an important and commonly-used approach to hierarchy visualization, but an important limitation of treemaps is the difficulty of discerning the structure of a hierarchy. This paper presents cascaded treemaps, a new approach to treemap presentation that is based in cascaded rectangles instead of the traditional nested rectangles. Cascading uses less space to present the same contain...
متن کامل6.3 Treemaps: a space-filling approach to the visualization of hierarchical information structures
This paper describes a novel method for the visualization of hierarchically structured information. The treemap visualization technique makes 100% use of the available display space, mapping the full hierarchy onto a rectangular region in a space-filling manner. This efficient use of space allows very large hierarchies to be displayed in their entirety and facilitates the presentation of semant...
متن کاملBeamtrees: Compact Visualization of Large Hierarchies
Beamtrees are a new method for the visualization of large hierarchical data sets. Nodes are shown as stacked circular beams, such that both the hierarchical structure as well as the size of nodes are depicted. The dimensions of beams are calculated using a variation of the treemap algorithm. A small user study indicated that beamtrees are significantly more effective than nested treemaps and cu...
متن کاملFacilitating Visual Queries in the TreeMap Using Distortion Techniques
TreeMap is one a common space-filling visualization technique to display large hierarchies in a limited display space. In TreeMaps, highlighting techniques are widely used to depict search results from visual queries. To improve visualizing the queries results in the TreeMap, we designed a continuous animated multi-distortion algorithm based on fisheye and continuous zooming techniques. To eval...
متن کامل